Spatial transportation networks with transfer costs: asymptotic optimality of hub-and-spoke models
نویسندگان
چکیده
منابع مشابه
Spatial transportation networks with transfer costs: asymptotic optimality of hub-and-spoke models
Consider networks on n vertices at average density 1 per unit area. We seek a network that minimizes total length subject to some constraint on journey times, averaged over sourcedestination pairs. Suppose journey times depend on both route-length and number of hops. Then for the constraint corresponding to an average of 3 hops, the length of the optimal network scales as n13/10. Alternatively,...
متن کاملEuclidean Hub-and-Spoke Networks
The hub-and-spoke distribution paradigm has been a fundamental principle in geographic network design for more than 40 years. One of the primary advantages that such networks possess is their ability to exploit economies of scale in transportation by aggregating network flows through common sources. In this paper, we consider the problem of designing an optimal hub-and-spoke network in continuo...
متن کاملDesigning Hub and Spoke Transportation Systems for a Competitive Environment
In this paper, we consider the design of large-scale hub-and-spoke transportation networks in a competitive environment. We adopt the hub arc location model that locates arcs with discounted transport costs connecting pairs of hub facilities. Two firms compete for passengers in a Stackelberg framework where the leader firm locates hub arcs to maximize its revenue, given that the follower firm w...
متن کاملThe Reliable Hub-and-spoke Design Problem: Models and Algorithms
This paper presents a study on reliable single and multiple allocation hub-and-spoke network design problems where disruptions at hubs and the resulting hub unavailability can be mitigated by backup hubs and alternative routes. It builds nonlinear mixed integer programming models and presents linearized formulas. To solve those difficult problems, Lagrangian relaxation and Branch-and-Bound meth...
متن کاملOptimal Spatial Pricing Strategies with Transportation Costs
We consider an optimization problem in a given region Q where an agent has to decide the price p(x) of a product for every x ∈ Q. The customers know the pricing pattern p and may shop at any place y, paying the cost p(y) and additionally a transportation cost c(x, y) for a given transportation cost function c. We will study two models: the first one where the agent operates everywhere on Q and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Proceedings of the Cambridge Philosophical Society
سال: 2008
ISSN: 0305-0041,1469-8064
DOI: 10.1017/s0305004108001242